Semi-regular masas of transfinite length
نویسندگان
چکیده
In 1965 Tauer produced a countably infinite family of semi-regular masas in the hyperfinite II1 factor, no pair of which are conjugate by an automorphism. This was achieved by iterating the process of passing to the algebra generated by the normalisers and, for each n ∈ N, finding masas for which this procedure terminates at the n-th stage. Such masas are said to have length n. In this paper we consider a transfinite version of this idea, giving rise to a notion of ordinal valued length. We show that all countable ordinals arise as lengths of semiregular masas in the hyperfinite II1 factor. Furthermore, building on work of Jones and Popa, we obtain all possible combinations of regular inclusions of irreducible subfactors in the normalising tower.
منابع مشابه
A continuous path of singular masas in the hyperfinite II1 factor
Using methods of R.J.Tauer [13] we exhibit an uncountable family of singular masas in the hyperfinite II1 factor R all with Pukánszky invariant {1}, no pair of which are conjugate by an automorphism of R. This is done by introducing an invariant Γ(A) for a masa A in a II1 factor N as the maximal size of a projection e ∈ A for which Ae contains non-trivial centralising sequences for eNe. The mas...
متن کاملOn the Uniqueness of Af Diagonals in Regular Limit Algebras
Necessary and sufficient conditions are obtained for the uniqueness of standard regular AF masas in regular limit algebras up to approximate inner unitary equivalence.
متن کاملTransfinite Diameter and the Resultant
We prove a formula for the Fekete-Leja transfinite diameter of the pullback of a set E ⊂ C by a regular polynomial map F , expressing it in terms of the resultant of the leading part of F and the transfinite diameter of E. We also establish the nonarchimedean analogue of this formula. A key step in the proof is a formula for the transfinite diameter of the filled Julia set of F .
متن کاملElementary Theory of Ordinals with Addition and Left Translation by omega
After Büchi it has become very natural to interprete formulae of certain logical theories as finite automata, i.e., as recognizing devices. This recognition aspect though, was neglected by the inventor of the concept and the study of the families of linear structures that could be accepted in the language theory sense of the term, was carried out by other authors. The most popular field of appl...
متن کاملUniform regular enumerations
In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalization of a theorem of Ash and a characterization of a class of uniform operators on transfinite sequences of sets of natural numbers.
متن کامل